An Evaluation of Planar - Adaptive Routing ( PAR ) 1

نویسندگان

  • Jae H. Kim
  • Andrew A. Chien
چکیده

Network performance can be improved by allowing adaptive routing, but doing so introduces new possibilities of deadlock which can overwhelm the exibility advantages. Planar-adaptive routing (PAR) resolves this tension by limiting adaptive routing to a series of two-dimensional planes, reducing hardware requirements for deadlock prevention. We explore the performance of planar-adaptive routers for two, three, and four-dimensional networks. Under non-uniform traac loads, the planar-adaptive router signiicantly outperforms the dimension-order router, while giving comparable performance under uniform loads. With equal resources, the planar-adaptive router provides superior performance to fully-adaptive routers because it requires less resources for deadlock prevention, freeing resources to increase the number of virtual lanes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)

Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...

متن کامل

Performance Analysis of Wormhole Switching with Adaptive Routing in a Two-Dimensional Torus

This paper presents an analytical evaluation of the performance of wormhole switching with adaptive routing in a two-dimensional torus. Our analysis focuses on minimal and fully adaptive routing that allows a message to use any shortest path between source and destination .

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

Modification of Sidelobe Canceller System In Planar Arrays (RESEARCH NOTE)

A Side Lobe Canceller (SLC) structure is a conventional partially adaptive technique which is used in large adaptive array radars. If a desired signal has long time duration in comparison with the SLC adaptation time, signal components may be cancelled. So, this paper presents a modified SLC which eliminates desired signal cancellation problems and allows using an unconstrained adaptive algorit...

متن کامل

Intuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks

In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992